skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Norin, Sergey"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; (, SIAM Journal on Discrete Mathematics)
    We prove that every connected P5-free graph has cop number at most two, solving a conjecture of Sivaraman. In order to do so, we first prove that every connected P5-free graph G with independence number at least three contains a three-vertex induced path with vertices a-b-c in order, such that every neighbor of c is also adjacent to one of a,b. 
    more » « less
    Full Text Available 
  2. ; ; ; ; ; (, Discrete & Computational Geometry)
    Full Text Available 
  3. ; ; ; ; (, SIAM Journal on Discrete Mathematics)
    Full Text Available 
  4. ; ; ; ; ; (, Procedia Computer Science)
    Full Text Available 
  5. ; ; ; ; ; (, SIAM Journal on Discrete Mathematics)
    Full Text Available 
  6. ; ; ; ; (, Combinatorica)
    Full Text Available